Learning Algorithm for Relation-Substitutable Context-Free Languages
نویسنده
چکیده
We generalized the class of k, l-substitutable languages (Yoshinala, 2008). Each language in the generalized class is closed under a good substitutability. The substitutability is defined by a recognizable equivalence relation. We show the convergence of our generalized learning algorithm. The size of the characteristic sample is smaller than Yoshinaka’s.
منابع مشابه
Identification in the Limit of Substitutable Context-Free Languages
This paper formalisms the idea of substitutability introduced by Zellig Harris in the 1950s and makes it the basis for a learning algorithm from positive data only for a subclass of context-free grammars. We show that there is a polynomial characteristic set, and thus prove polynomial identification in the limit of this class. We discuss the relationship of this class of languages to other comm...
متن کاملPolynomial Identification in the Limit of Substitutable Context-free Languages
This paper formalises the idea of substitutability introduced by Zellig Harris in the 1950s and makes it the basis for a learning algorithm from positive data only for a subclass of context-free languages. We show that there is a polynomial characteristic set, and thus prove polynomial identification in the limit of this class. We discuss the relationship of this class of languages to other com...
متن کاملLearning Optionality and Repetition
Adjuncts are syntactic elements that are optional, transparent to selection, and often, though not always, repeatable. Classic examples are adjectives and adverbs. How do learners learn optionaility? How do they learn repeatability? I explore a variety of learners’ approaches to optionality and repeatability, including both human learners and learning algorithms. Mathematically, a learner is a ...
متن کاملDesigning and Learning Substitutable Plane Graph Grammars
Though graph grammars have been widely investigated for 40 years, few learning results exist for them. The main reasons come from complexity issues that are inherent when graphs, and a fortiori graph grammars, are considered. The picture is however different if one considers drawings of graphs, rather than the graphs themselves. For instance, it has recently been proved that the isomorphism and...
متن کاملLearning trees from strings: a strong learning algorithm for some context-free grammars
Standard models of language learning are concerned with weak learning: the learner, receiving as input only information about the strings in the language, must learn to generalise and to generate the correct, potentially infinite, set of strings generated by some target grammar. Here we define the corresponding notion of strong learning: the learner, again only receiving strings as input, must ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1409.6247 شماره
صفحات -
تاریخ انتشار 2014